Realizing cell-like maps in Euclidean space
نویسندگان
چکیده
منابع مشابه
Realizing Finite Groups in Euclidean Space
A set of points W in Euclidean space is said to realize the finite group G if the isometry group of W is isomorphic to G. We show that every finite group G can be realized by a finite subset of some R n, with n < |G|. The minimum dimension of a Euclidean space in which G can be realized is called its isometry dimension. We discuss the isometry dimension of small groups and offer a number of ope...
متن کاملLipschitz maps and nets in Euclidean space
for x 6= x′. A set Y ⊂ Rn is a net if there is an R such that d(x, Y ) < R for every x ∈ Rn; it is separated if there is an ǫ > 0 such that |y − y′| > ǫ > 0 for every pair y 6= y′ in Y . History. In 1965, J. Moser showed that any two positive, C∞ volume forms on a compact manifold with the same total mass are related by a diffeomorphism [Mos]. Extensions of this result to other smoothness class...
متن کاملOn the Quaternionic Curves in the Semi-Euclidean Space E_4_2
In this study, we investigate the semi-real quaternionic curves in the semi-Euclidean space E_4_2. Firstly, we introduce algebraic properties of semi-real quaternions. Then, we give some characterizations of semi-real quaternionic involute-evolute curves in the semi-Euclidean space E42 . Finally, we give an example illustrated with Mathematica Programme.
متن کاملCharacterizations of Slant Ruled Surfaces in the Euclidean 3-space
In this study, we give the relationships between the conical curvatures of ruled surfaces generated by the unit vectors of the ruling, central normal and central tangent of a ruled surface in the Euclidean 3-space E^3. We obtain differential equations characterizing slant ruled surfaces and if the reference ruled surface is a slant ruled surface, we give the conditions for the surfaces generate...
متن کاملAn algorithm for realizing Euclidean distance matrices
We present an efficient algorithm to find a realization of a (full) n × n squared Euclidean distance matrix in the smallest possible dimension. Most existing algorithms work in a given dimension: most of these can be transformed to an algorithm to find the minimum dimension, but gain a logarithmic factor of n in their worstcase running time. Our algorithm performs cubically in n (and linearly w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: General Topology and its Applications
سال: 1972
ISSN: 0016-660X
DOI: 10.1016/0016-660x(72)90039-6